On the IP Traffic Matrix Problem in Hybrid SDN/OSPF Networks
نویسندگان
چکیده
IP networks with a hybrid control plane deploy a distributed routing protocol like OSPF and the centralized paradigm of SDN in parallel. The advantages and disadvantages of a hybrid control plane have already been extensively discussed in the literature. This paper examines to what extent hybrid SDN/OSPF can solve the IP traffic matrix and related monitoring problems, inherent to the IP layer. The problem persists in hybrid networks, as the required SDN byte counters for a complete traffic matrix may not be sufficiently implemented (or even not at all), or the deployed SDN nodes may be too few, or not adequately located in the network. For such cases, we propose to augment the SDN traffic statistics with SNMP-based measurements on IP backup links. We address implementation and network function virtualization aspects of the required hybrid monitoring infrastructure and discuss the timing issues of the measurements based on hands-on experiences in our lab. We furthermore provide a placement algorithm for SDN nodes and backup links that can guarantee a complete IP traffic matrix.
منابع مشابه
Link Capacity Planning for Fault Tolerant Operation in Hybrid SDN/OSPF Networks
Link capacity dimensioning is the periodic task where ISPs have to make provisions for sudden traffic bursts and network failures to assure uninterrupted operations. This provision comes in the form of link working capacities with noticeable amounts of headroom, i.e., spare capacities that are used in case of congestions or network failures. Distributed routing protocols like OSPF provide conve...
متن کاملSurvivable IP network design with OSPF routing
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc weights assigned by the network operator. Each router computes shortest paths and creates destination tables used for routing flow on the shortest paths. If a router has multiple outgoing links on shortest paths to a g...
متن کاملOSPF Routing with Optimal Oblivious Performance Ratio Under Polyhedral Demand Uncertainty
We study the best OSPF style routing problem in telecommunication networks, where weight management is employed to get a routing configuration with the minimum oblivious ratio. We consider polyhedral demand uncertainty: the set of traffic matrices is a polyhedron defined by a set of linear constraints, and the performance of each routing is assessed on its worst case congestion ratio for any fe...
متن کاملAdaptive Traffic Engineering in MPLS and OSPF Networks
Traffic engineering refers to performance optimization of operational networks. One task of traffic engineering is load balancing, the idea of which is to move traffic from congested links to other parts of the network in a well-controlled way. If the traffic demands are known, the load balancing can be formulated as an optimization problem. MPLS brings up new possibilities , such as explicit r...
متن کاملAdaptive load balancing with OSPF
The objective of load balancing is to move traffic from congested links to other parts of the network. If the traffic demands are known, the load balancing can be formulated as an optimization problem. The resulting traffic allocation can be realized in the networks that use explicit routes, such as MPLS-networks. It has recently been found that a similar load balancing is possible to be implem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1610.08256 شماره
صفحات -
تاریخ انتشار 2016